Faster sequential universal coding via block partitioning

Nonparametric Decentralized Sequential Detection via Universal Source Coding

We consider nonparametric or universal sequential hypothesis testing problem when the distribution under the null hypothesis is fully known but the alternate hypothesis corresponds to some other unknown distribution. These algorithms are primarily motivated from spectrum sensing in Cognitive Radios and intruder detection in wireless sensor networks. We use easily implementable universal lossles...

Sequential Mesh Coding Using Wave Partitioning

Recently, various three-dimensional(3-D) mesh coding schemes have been proposed to improve compression efficiency or error resilience. However, we need to consider both coding efficiency and error resilience when we send 3-D mesh data over bandwidth-limited transmission channels. In this paper, we propose a sequential mesh coding algorithm using the vertex pedigree based on the wave partitionin...

Information retrieval via universal source coding

An Accelerated Block-Parallel Newton Method via Overlapped Partitioning

This paper presents an overlapped block-parallel Newton method for solving large nonlinear systems. The graph partitioning algorithms are first used to partition the Jacobian into weakly coupled overlapping blocks. Then the simplified Newton iteration is directly performed, with the diagonal blocks and the overlapping solutions assembled in a weighted average way at each iteration. In the algor...

Low-Complexity Waveform Coding via Alphabet and Sample-Set Partitioning

We propose a new low-complexity entropy-coding method to be used for coding waveform signals. It is based on the combination of two schemes: (1) an alphabet partitioning method to reduce the complexity of the entropy-coding process; (2) a new recursive set partitioning entropy-coding process that achieves rates smaller than rst order entropy even with fast Hu man adaptive codecs. Numerical resu...